A return to the traveling salesman model: a network branch and bound approach
نویسندگان
چکیده
منابع مشابه
a frame semantic approach to the study of translating cultural scripts in salingers franny and zooey
the frame semantic theory is a nascent approach in the area of translation studies which goes beyond the linguistic barriers and helps us to incorporate cognitive and cultural factors to the study of translation. based on rojos analytical model (2002b), which centered in the frames or knowledge structures activated in the text, the present research explores the various translation problems that...
15 صفحه اولSolving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network
This paper is the rst to present a parallelization of a highly eecient best-rst branch-and-bound algorithm to solve large symmetric traveling salesman problems on a massively parallel computer containing 1024 processors. The underlying sequential branch-and-bound algorithm is based on 1-tree relaxation. The parallelization of the branch-and-bound algorithm is fully distributed. Every processor ...
متن کاملA Java Implementation of the Branch and Bound Algorithm: The Asymmetric Traveling Salesman Problem
This paper offers a description of a Java implementation of the branch-and-bound (BnB) algorithm for the Traveling Salesman Problem with asymmetric cost matrix (ATSP). A generic interface for solving minimization problems with BnB is proposed and the results of computational experiments for ATSP with random cost matrices are given for different problem sizes (50, 100, 150, 200, 250, and 300 cit...
متن کاملA Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
This paper deals with the Close-Enough Traveling Salesman Problem (CETSP). In the CETSP, rather than visiting the vertex (customer) itself, the salesman must visit a specific region containing such vertex. To solve this problem, we propose a simple yet effective exact algorithm, based on Branch-and-Bound and Second Order Cone Programming (SOCP). The proposed algorithm was tested in 824 instance...
متن کاملa synchronic and diachronic approach to the change route of address terms in the two recent centuries of persian language
terms of address as an important linguistics items provide valuable information about the interlocutors, their relationship and their circumstances. this study was done to investigate the change route of persian address terms in the two recent centuries including three historical periods of qajar, pahlavi and after the islamic revolution. data were extracted from a corpus consisting 24 novels w...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: South African Journal of Economic and Management Sciences
سال: 2013
ISSN: 2222-3436,1015-8812
DOI: 10.4102/sajems.v16i1.175